#define _CRT_SECURE_NO_WARNINGS 1
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include<math.h>
#include<stdlib.h>
#include<stdio.h>
#include<unordered_map>
#include<queue>
#include<stack>
#include <functional>
#include <memory>
using namespace std;

class Solution {
public:
    int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
        int m = obstacleGrid.size(), n = obstacleGrid[0].size();
        vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
        dp[0][1] = 1;
        for (int i = 1; i <= m; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (obstacleGrid[i - 1][j - 1] == 0)
                {
                    if (i - 2 < 0 || obstacleGrid[i - 2][j - 1] == 0)
                        dp[i][j] += dp[i - 1][j];
                    if (j - 2 < 0 || obstacleGrid[i - 1][j - 2] == 0)
                        dp[i][j] += dp[i][j - 1];
                }
            }
        }

        return dp[m][n];
    }
};
int main()
{
    vector<int> in(30, -1);
	return 0;
}